package 剑指Offer;

/**
 * @author zerorain
 * @date 2022/08/04 15:32
 **/
// num746 使用最小花费爬楼梯 dp问题
public class Num746 {
        public int minCostClimbingStairs(int[] cost) {
            int n = cost.length;
            int[] dp = new int[n + 1];
            dp[0] = dp[1] = 0;
            for (int i = 2; i <= n; i++) {
                dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
            }
            return dp[n];
        }
}